An Empirical Criterion for Transitive Closure
نویسندگان
چکیده
منابع مشابه
New empirical failure criterion for shale
A new failure criterion was presented to predict the ultimate strength of shale under the triaxial and polyaxial state of stress. A database containing 93 datasets was obtained from the results of the uniaxial, triaxial, polyaxial compressive tests, an indirect tensile test was collected from reliable references, and this test was carried out on the shale samples taken from the southwestern oil...
متن کاملAn Experimental Study on Transitive Closure Representations
We present two new compact transitive closure representations. The rst uses intervals and the second chains to store the closure. Both representations are based on previous methods designed for acyclic graphs. The new representations are applicable to all kinds of graphs, and can be eeciently constructed during a single traversal of the input graph. We compared experimentally the average size o...
متن کاملHybrid Transitive Closure Algorithms
We present a new family of hybrid transitive closure algorithms, and present experimental results showing that these algorithms perform better than existing transitive closure algorithms, includmg matrix-based algorithms that divide a matrix into stripes or into square blocks, and graph-based algmtihms. This family of algorithms can be generalized to solve path problems and to solve problems in...
متن کاملTransitive-closure spanners
We define the notion of a transitive-closure spanner of a directed graph. Given a directed graph G = (V,E) and an integer k ≥ 1, a k-transitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V,EH) that has (1) the same transitive-closure as G and (2) diameter at most k. These spanners were studied implicitly in access control, property testing, and data structures, and properties ...
متن کاملEecient Transitive Closure Computation
We present two new transitive closure algorithms that are based on strong component detection. The algorithms scan the input graph only once without generating partial successor sets for each node. The new algorithms eliminate the redundancy caused by strong components more e ciently than previous transitive closure algorithms. We present statistically sound simulation experiments showing that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2022
ISSN: ['1552-6607', '1549-3636']
DOI: https://doi.org/10.3844/jcssp.2022.1232.1236